MMIR Mining Multi%2Dscale Intervention Rules in Sub%2DComplex System.

Constrained global scheduling of streaming applications on MPSoCs.
Abstract — We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. The global scheduling of processors computing and communication transactions are formulated as constraint based problem, to avoid the scheduling overhead in TDMA-like heuristic schemes. A public domain constraint solver is exploited to solve the NPcomplete scheduling efficiently, together with problem specific constraint modeling techniques. Experimental results show that the proposed framework can achieve a high predictable application throughput with minimized buffer cost. For instance, for applications in communication domain, higher throughput (up to 87%) has been observed with less buffer cost, compared to scenarios considering the heuristic scheduling overhead. I.
Pareto efficient design for reconfigurable streaming applications on CPU%2FFPGAs.

Latent Variables in Bayesian Network Construction and Inference.

Pareto efficient design for reconfigurable streaming applications on CPU%2FFPGAs.

Low%2DComplexity Coordinated Beamforming Transmission for Multiuser MISO Systems and Its Performance Analysis.

Research on Chinese Listed Company%27s Financial Crisis Based on SVM Classification.

Design and Control of a Hydraulic%2DActuated Leg Exoskeleton for Load%2DCarrying Augmentation.

Conditional Topic Random Fields.
GenerativetopicmodelssuchasLDAarelimited by their inability to utilize nontrivial input features to enhance their performance, and many topic models assume that topic assignmentsofdifferent wordsareconditionally independent. Some work exists to address the second limitation but no work exists to address both. This paper presents a conditional topic random field (CTRF) model, which can use arbitrary nonlocal features about words and documents and incorporate the Markov dependency between topic assignments of neighboring words. We develop an efficient variational inference algorithm that scales linearly in terms of topic numbers, and a maximum likelihood estimation (MLE) procedure for parameter estimation. For the supervised version of CTRF, we alsodevelopan arguablymorediscriminative max-margin learning method. We evaluate CTRF on real review rating data and demonstrate the advantages of CTRF over generative competitors, and we show the advantages of max-margin learning over MLE. 1.
Grafting%2Dlight fast

Sum%2DRate Analysis of Multiuser MIMO Systems with Codebook%2DBased Incremental Beamforming.

An Efficient Approach for Mining Segment%2DWise Intervention Rules in Time%2DSeries Streams.

A grid%2Dbased collaborative virtual geographic environment for the planning of silt dam systems.

Mining Interventions from Parallel Event Sequences.

SLICE A Novel Method to Find Local Linear Correlations by Constructing Hyperplanes.

Intervention Events Detection and Prediction in Data Streams.

SLICE A Novel Method to Find Local Linear Correlations by Constructing Hyperplanes.

Meta Galaxy A Flexible and Efficient Cube Model for Data Retrieval in OLAP.

Towards a Practical and Effective Method for Web Services Test Case Generation.

Towards Call for Testing An Application to User Acceptance Testing of Web Applications.

The role research in group awareness model.

A role hierarchical group awareness model and its time possibility analysis based fuzzy time.

Buffer minimization of real%2Dtime streaming applications scheduling on hybrid CPU%2FFPGA architectures.

Dynamic Simulation of Passive Walker Based on Virtual Gravity Theory.

MedLDA maximum margin supervised topic models for regression and classification.
Supervised topic models utilize document’s side information for discovering predictive low dimensional representations of documents; and existing models apply likelihoodbased estimation. In this paper, we present a max-margin supervised topic model for both continuous and categorical response variables. Our approach, the maximum entropy discrimination latent Dirichlet allocation (MedLDA), utilizes the max-margin principle to train supervised topic models and estimate predictive topic representations that are arguably more suitable for prediction. We develop efficient variational methods for posterior inference and demonstrate qualitatively and quantitatively the advantages of MedLDA over likelihood-based topic models on movie review and 20 Newsgroups data sets. 1.
On primal and dual sparsity of Markov networks.
Sparsity is a desirable property in high dimensional learning. The ℓ1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining these two methods, an ℓ1-norm max-margin Markov network (ℓ1-M3N) can achieve both types of sparsity. This paper analyzes its connections to the Laplace maxmargin Markov network (LapM 3 N), which inherits the dual sparsity of max-margin models but is pseudo-primal sparse, and to a novel adaptive M 3 N (AdapM 3 N). We show that the ℓ1-M 3 N is an extreme case of the LapM 3 N, and the ℓ1-M 3 N is equivalent to an AdapM 3 N. Based on this equivalence we develop a robust EM-style algorithm for learning an ℓ1-M 3 N. We demonstrate the advantages of the simultaneously (pseudo-) primal and dual sparse models over the ones which enjoy either primal or dual sparsity on both synthetic and real data sets. 1.
A Unified Test Framework for Continuous Integration Testing of SOA Solutions.

High%2Dlevel estimation and trade%2Doff analysis for adaptive real%2Dtime systems.

Primal sparse Max%2Dmargin Markov networks.
Max-margin Markov networks (M 3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M 3 N enjoys dual sparsity. However, the existing M 3 N formulation does not enjoy primal sparsity, which is a desirable property for selecting significant features and reducing the risk of over-fitting. In this paper, we present an ℓ1-norm regularized max-margin Markov network (ℓ1-M 3 N), which enjoys dual and primal sparsity simultaneously. To learn an ℓ1-M 3 N, we present three methods including projected sub-gradient, cutting-plane, and a novel EM-style algorithm, which is based on an equivalence between ℓ1-M 3 N and an adaptive M 3 N. We perform extensive empirical studies on both synthetic and real data sets. Our experimental results show that: (1) ℓ1-M 3 N can effectively select significant features; (2) ℓ1-M 3 N can perform as well as the pseudo-primal sparse Laplace M 3 N in prediction accuracy, while consistently outperforms other competing methods that enjoy either primal or dual sparsity; and (3) the EM-algorithm is more robust than the other two in prediction accuracy and time efficiency.
User grouping behavior in online forums.
Online forums represent one type of social media that is particularly rich for studying human behavior in information seeking and diffusing. The way users join communities is a reflection of the changing and expanding of their interests toward information. In this paper, we study the patterns of user participation behavior, and the feature factors that influence such behavior on different forum datasets. We find that, despite the relative randomness and lesser commitment of structural relationships in online forums, users’ community joining behaviors display some strong regularities. One particularly interesting observation is that the very weak relationships between users defined by online replies have similar diffusion curves as those of real friendships or co-authorships. We build social selection models, Bipartite Markov Random Field (BiMRF), to quantitatively evaluate the prediction performance of those feature factors and their relationships. Using these models, we show that some features carry supplementary information, and the effectiveness of different features vary in different types of forums. Moreover, the results of BiMRF with two-star configurations suggest that the feature of user similarity defined by frequency of communication or number of common friends is inadequate to predict grouping behavior, but adding node-level features can improve the fit of the model.
ORTS a tool for optimized regression testing selection.

Towards Selecting Test Data Using Topological Structure of Boolean Expressions.

An optimized change%2Ddriven regression testing selection strategy for binary Java applications.

Exploring Topological Structure of Boolean Expressions for Test Data Selection.

StatSnowball a statistical approach to extracting entity relationships.
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of training examples, but they usually apply heuristic-based methods to combine a set of strict hard rules, which limit the ability to generalize and thus generate a low recall. Furthermore, existing bootstrapping methods do not perform open information extraction (Open IE), which can identify various types of relations without requiring pre-specifications. In this paper, we propose a statistical extraction framework called Statistical Snowball (StatSnowball), which is a bootstrapping system and can perform both traditional relation extraction and Open IE. StatSnowball uses the discriminative Markov logic networks
Incorporating site%2Dlevel knowledge to extract structured data from web forums.
Categories and Subject Descriptors Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to both complex page layout designs and unrestricted user created posts. In this paper, we study the problem of structured data extraction from various web forum sites. Our target is to find a solution as general as possible to extract structured data, such as post title, post author, post time, and post content from any forum site. In contrast to most existing information extraction methods, which only leverage the knowledge inside an individual page, we incorporate both page-level and site-level knowledge and employ Markov logic networks (MLNs) to effectively integrate all useful evidence by learning their importance automatically. Site-level knowledge includes (1) the linkages among different object pages, such as list pages and post pages, and (2) the interrelationships of pages belonging to the same object. The experimental results on 20 forums show a very encouraging information extraction performance, and demonstrate the ability of the proposed approach on various forums. We also show that the performance is limited if only page-level knowledge is used, while when incorporating the site-level knowledge both precision and recall can be significantly improved.
A novel method for real parameter optimization based on Gene Expression Programming.

Using a mutual information%2Dbased site transition network to map the genetic evolution of influenza A%2FH3N2 virus.

Multi%2Dfrequency identification method in signal processing.

Hermite WENO Schemes and Their Application as Limiters for Runge%2DKutta Discontinuous Galerkin Method

Maximum Entropy Discrimination Markov Networks.
Standard max-margin structured prediction methods concentrate directly on the inputoutput mapping, and the lack of an elegant probabilistic interpretation causes limitations. In this paper, we present a novel framework called Maximum Entropy Discrimination Markov Networks (MaxEntNet) to do Bayesian max-margin structured learning by using expected margin constraints to define a feasible distribution subspace and applying the maximum entropy principle to choose the best distribution from this subspace. We show that MaxEntNet subsumes the standard max-margin Markov networks (M 3 N) as a spacial case where the predictive model is assumed to be linear and the parameter prior is a standard normal. Based on this understanding, we propose the Laplace max-margin Markov networks (LapM 3 N) which use the Laplace prior instead of the standard normal. We show that the adoption of a Laplace prior of the parameter makes LapM 3 N enjoy properties expected from a sparsified M 3 N. Unlike the L1-regularized maximum likelihood estimation which sets small weights to zeros to achieve sparsity, LapM 3 N posteriorly weights the parameters and features with smaller weights are shrunk more. This posterior weighting effect makes LapM 3 N more stable with respect to the magnitudes of the regularization coefficients and more generalizable. To
Study and application of temporal index technology.

Timeline Analysis of Web News Events.

Term Weighting Evaluation in Bipartite Partitioning for Text Clustering.

Discovering Multi%2Ddimensional Major Medicines from Traditional Chinese Medicine Prescriptions.

A Plugin%2DBased Software Production Line Integrated Framework.

Energy efficient streaming applications with guaranteed throughput on MPSoCs.
In this paper we present a design space exploration flow to achieve energy efficiency for streaming applications on MPSoCs while meeting the specified throughput constraints. The public domain simulators Sim-Panalyzer and Cacti are used to estimate the energy dissipations of the parameterized architectural components. As the main contributions, we schedule the streaming applications on a multi-clock synchronous modeling framework, guarantee the application timing properties by throughput analysis, and customize both processor voltage-frequency levels and memory sizes in the design space to optimize the application pipeline parallelism for energy efficiency. Two widely used heuristic algorithms (i.e., greedy and taboo search) are used during the design optimization process. Our experiments show an energy reduction of 21 % without any loss in application throughput compared with an ad-hoc approach.
Performance analysis of reconfiguration in adaptive real%2Dtime streaming applications.
We propose a design optimization framework for adaptive real-time streaming applications. The main contribution is a hybrid approach for performance analysis combining formal analysis and simulation using a two-phase framework. We formulate the scheduling problem of adaptive streaming applications with ILP analysis, and use the simulation based on the synchronous model of computation to ensure throughput guarantees. We finally illustrate the capabilities of our methodology by experiments. 1.
MovStream An Efficient Algorithm for Monitoring Clusters Evolving in Data Streams.

Hybrid Intelligent Algorithm for Job%2DShop Scheduling under Uncertainty.

Laplace maximum margin Markov networks.

A Lightweight Approach to Partially Reuse Existing Component%2DBased System in Service%2DOriented Environment.

A Runtime%2DMonitoring%2DBased Dependable Software Construction Method.

Surrogate A Simulation Apparatus for Continuous Integration Testing in Service Oriented Architecture.

Partially Observed Maximum Entropy Discrimination Markov Networks.
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unattainable fully annotated training data. While likelihood-based methods have been extensively explored, to our knowledge, learning structured prediction models with latent variables based on the max-margin principle remains largely an open problem. In this paper, we present a partially observed Maximum Entropy Discrimination Markov Network (PoMEN) model that attempts to combine the advantages of Bayesian and margin based paradigms for learning Markov networks from partially labeled data. PoMEN leads to an averaging prediction rule that resembles a Bayes predictor that is more robust to overfitting, but is also built on the desirable discriminative laws resemble those of the M 3 N. We develop an EM-style algorithm utilizing existing convex optimization algorithms for M 3 N as a subroutine. We demonstrate competent performance of PoMEN over existing methods on a real-world web data extraction task. 1
Path%2Dbased verification for composition of semantic web services.

QTLNetwork mapping and visualizing genetic architecture of complex traits in experimental populations.

Using matrix of thresholding partial correlation coefficients to infer regulatory network.

Dynamic Hierarchical Markov Random Fields for Integrated Web Data Extraction.

Blind multiuser detection using the subspace%2Dbased linearly constrained LSCMA.

A Novel Text Classification Approach Based on Enhanced Association Rule.

Compatibility Analysis and Mediation%2DAided Composition for BPEL Services.

A segment%2Dbased approach for reconcilable model transformation.

A segment%2Dbased approach for reconcilable model transformation.

Concern Oriented Business Process Modeling.

Dynamic hierarchical Markov random fields and their application to web data extraction.
Hierarchical models have been extensively studied in various domains. However, existing models assume fixed model structures or incorporate structural uncertainty generatively. In this paper, we propose Dynamic Hierarchical Markov Random Fields (DHMRFs) to incorporate structural uncertainty in a discriminative manner. DHMRFs consist of two parts – structure model and class label model. Both are defined as exponential family distributions. Conditioned on observations, DHMRFs relax the independence assumption as made in directed models. As exact inference is intractable, a variational method is developed to learn parameters and to find the MAP model structure and label assignment. We apply the model to a real-world web data extraction task, which automatically extracts product items for sale on the Web. The results show promise. 1.
Business Process Regression Testing.

Webpage understanding an integrated approach.
Recent work has shown the effectiveness of leveraging layout and tag-tree structure for segmenting webpages and labeling HTML elements. However, how to effectively segment and label the text contents inside HTML elements is still an open problem. Since many text contents on a webpage are often text fragments and not strictly grammatical, traditional natural language processing techniques, that typically expect grammatical sentences, are no longer directly applicable. In this paper, we examine how to use layout and tag-tree structure in a principled way to help understand text contents on webpages. We propose to segment and label the page structure and the text content of a webpage in a joint discriminative probabilistic model. In this model, semantic labels of page structure can be leveraged to help text content understanding, and semantic labels of the text phrases can be used in page structure understanding tasks such as data record detection. Thus, integration of both page structure and text content understanding leads to an integrated solution of webpage understanding. Experimental results on research homepage extraction show the feasibility and promise of our approach.
Statistical power of phylo%2DHMM for evolutionarily conserved element detection.

Mapping the genetic architecture of complex traits in experimental populations.

Design and development of Distributed Virtual Geographic Environment system based on web services.

A collaborative virtual geographic environment based on P2P and Grid technologies.

Study on Data Collaboration Service for Collaborative Virtual Geographic Environment.

A Distributed Computing Service for Neural Networks and Its Application to Flood Peak Forecasting.

Towards Facilitating Development of SOA Application with Design Metrics.

2D Conditional Random Fields for Web information extraction.
The Web contains an abundance of useful semistructured information about real world objects, and our empirical study shows that strong sequence characteristics exist for Web information about objects of the same type across different Web sites. Conditional Random Fields (CRFs) are the state of the art approaches taking the sequence characteristics to do better labeling. However, as the information on a Web page is two-dimensionally laid out, previous linear-chain CRFs have their limitations for Web information extraction. To better incorporate the two-dimensional neighborhood interactions, this paper presents a two-dimensional CRF model to automatically extract object information from the Web. We empirically compare the proposed model with existing linear-chain CRF models for product information extraction, and the results show the effectiveness of our model. 1.
Simultaneous record detection and attribute labeling in web data extraction.
Recent work has shown the feasibility and promise of templateindependent Web data extraction. However, existing approaches use decoupled strategies – attempting to do data record detection and attribute labeling in two separate phases. In this paper, we show that separately extracting data records and attributes is highly ineffective and propose a probabilistic model to perform these two tasks simultaneously. In our approach, record detection can benefit from the availability of semantics required in attribute labeling and, at the same time, the accuracy of attribute labeling can be improved when data records are labeled in a collective manner. The proposed model is called Hierarchical Conditional Random Fields. It can efficiently integrate all useful features by learning their importance, and it can also incorporate hierarchical interactions which are very important for Web data extraction. We empirically compare the proposed model with existing decoupled approaches for product information extraction, and the results show significant improvements in both record detection and attribute labeling.
2D Conditional Random Fields for Web information extraction.
The Web contains an abundance of useful semistructured information about real world objects, and our empirical study shows that strong sequence characteristics exist for Web information about objects of the same type across different Web sites. Conditional Random Fields (CRFs) are the state of the art approaches taking the sequence characteristics to do better labeling. However, as the information on a Web page is two-dimensionally laid out, previous linear-chain CRFs have their limitations for Web information extraction. To better incorporate the two-dimensional neighborhood interactions, this paper presents a two-dimensional CRF model to automatically extract object information from the Web. We empirically compare the proposed model with existing linear-chain CRF models for product information extraction, and the results show the effectiveness of our model. 1.
Model%2Ddriven business process integration and management A case study with the Bank SinoPac regional service platform.

Remembering to Add Competence%2Dpreserving Case%2DAddition Policies for Case Base Maintenance.
Case-base maintenance is gaining increasing recognition in research and the practical applications of case-based reasoning (CBR). This intense interest is highlighted by Smyth and Keane&#039;s research on case deletion policies. In their work, Smyth and Keane advocated a case deletion policy, whereby the cases in a case base are classified and deleted based on their coverage potential and adaptation power. The algorithm was empirically shown to improve the competence of a CBR system and outperform a number of previous deletion-based strategies. In this paper, we present a different case-base maintenance policy that is based on case addition rather than deletion. The advantage of our algorithm is that we can place a lower bound on the competence of the resulting case base; we demonstrate that the coverage of the computed case base cannot be worse than the optimal case base in coverage by a fixed lower bound, and the coverage is often much closer to optimum. We also show that the Smyth and Ke...
Database Search Based on Bayesian Alignment.

Bayesian adaptive sequence alignment algorithms.
18 Blank, R.D. et al. (1988) A linkage map of mouse chromosome 12: Localization of Igh and effects of sex and interference on recombination. Genetics 120, 1073–1084 19 Churchill, G.A. et al. (1993) Pooled-sampling makes high resolution mapping practical with DNA markers. Proc. Natl.
Intrusion ripple analysis in distributed information systems.

Bayesian Adaptive Alignment and Inference.

